Least eigenvalue of the connected graphs whose complements are cacti
نویسندگان
چکیده
منابع مشابه
The least eigenvalue of graphs whose complements are unicyclic
A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum among all graphs in that class. Bell et al. have identified a subclass within the connected graphs of order n and size m in which minimizing graphs belong (the complements of such graphs are either disconnected or contain a clique of size n 2 ). In this paper we discuss the ...
متن کاملCharacterization of the Minimizing Graph of the Connected Graphs Whose Complements Are Bicyclic
In a certain class of graphs, a graph is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum. A connected graph containing two or three cycles is called a bicyclic graph if its number of edges is equal to its number of vertices plus one. Let Gc 1,n and Gc 2,n be the classes of the connected graphs of order n whose complements are bicyclic with exactly two and t...
متن کاملThe Least Eigenvalue of Graphs
In this paper we investigate the least eigenvalue of a graph whose complement is connected, and present a lower bound for the least eigenvalue of such graph. We also characterize the unique graph whose least eigenvalue attains the second minimum among all graphs of fixed order.
متن کاملSome Families of Graphs whose Domination Polynomials are Unimodal
Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=sum_{i=gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $gamma(G)$ is the domination number of $G$. In this paper we present some families of graphs whose domination polynomials are unimodal.
متن کاملCritical graphs with connected complements
We show that given any vertex x of a k-colour-critical graph G with a connected complement, the graph G − x can be (k − 1)-coloured so that every colour class contains at least 2 vertices. This extends the well-known theorem of Gallai, that a k-colour-critical graph with a connected complement has at least 2k − 1 vertices. Our proof does not use matching theory. It is considerably shorter, conc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Mathematics
سال: 2019
ISSN: 2391-5455
DOI: 10.1515/math-2019-0097